Complementarity and quantum walks
نویسندگان
چکیده
Viv Kendon 2, ∗ and Barry C. Sanders 4 QOLS, Optics Section, Blackett Laboratory, Imperial College, London, SW7 2BW, United Kingdom. School of Physics and Astronomy, University of Leeds, Leeds, LS2 9JT, United Kingdom. Institute for Quantum Information Science, University of Calgary, Alberta T2N 1N4, Canada Centre for Quantum Computer Technology, Macquarie University, Sydney, New South Wales 2109, Australia (Dated: April 7, 2004, revised August 20, 2004 and November 9th, 2004)
منابع مشابه
Watson-Crick Walks and Roads on DOL Graphs
Apart from the massive parallelism of DNA strands, the phenomenon known as Watson-Crick complementarity is basic both in the experiments and theory of DNA computing. The parallelism makes exhaustive searches possible, whereas the complementarity is a powerful computational tool. This paper investigates complementarity as a language-theoretic operation: \bad" words obtained through a generative ...
متن کاملUnitary equivalent classes of one-dimensional quantum walks
This study investigates unitary equivalent classes of one-dimensional quantum walks. We prove that one-dimensional quantum walks are unitary equivalent to quantum walks of Ambainis type and that translation-invariant one-dimensional quantum walks are Szegedy walks. We also present a necessary and sufficient condition for a onedimensional quantum walk to be a Szegedy walk.
متن کاملQuantum Walks
Quantum walks can be considered as a generalized version of the classical random walk. There are two classes of quantum walks, that is, the discrete-time (or coined) and the continuous-time quantum walks. This manuscript treats the discrete case in Part I and continuous case in Part II, respectively. Most of the contents are based on our results. Furthermore, papers on quantum walks are listed ...
متن کاملWorkshop of Quantum Simulation and Quantum Walks
[Invited talk] Novel approach for the implementation of quantum walks in linear optics setups Quantum walks without coin: a link between the properties of a graph and the admissible walks over it
متن کاملThe expressive power of quantum walks in terms of language acceptance
Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal quantum gate set. In this paper, we examine computation by quantum walks in terms of language acceptance, and present two ways in which discrete time quantum walks can accept some languages with certainty. These walks can take quantum as well as class...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004